Reduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes
نویسندگان
چکیده
In this paper, we compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to significantly outperform turbo codes in several scenarios [1],[2]. One particularly useful application is to replace a turbo code with an RPCC+turbo code based on constituent codes of smaller memory. This combination can provide comparable or better performance while also achieving a lower decoder complexity [2]. However, the complexity of the iterative MAP decoder for such a code is still relatively high. In this paper, we compare several different decoding strategies for the RPCC+turbo code that offer various trade-offs between performance and complexity.
منابع مشابه
Concatenated Codes Based on Multidimensional Parity-check Codes and Turbo Codes
Turbo-codes provide communications near capacity when very large interleavers (and thus codeword lengths) are used. However, many military communication systems require packet lengths that are too short to exploit the full capability of these codes. We have previously shown that a rectangular parity-check code can be used as an outer code with a turbo code as an inner code in a serial concatena...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملDesign of Parallel Concatenated Convolutional Codes - Communications, IEEE Transactions on
.’ parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. ...
متن کاملTurbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pearl’s belief propagation algorithm. We shall see that if Pearl’s algorithm is applied to the “belief network...
متن کاملUnveiling turbo codes: some results on parallel concatenated coding schemes
A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the rst encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the rst encoder followed by the parity check bits of both encoders. This construction can be gener...
متن کامل